Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints

نویسندگان

  • Xiaoping Hu
  • Narendra Ahuja
چکیده

1041 and then the line invariant (6) was computed for each pair of line sets and compared using the metric (7). The sets of lines chosen are given in the following table (refer to Fig. I). The table in (9) shows the results. The only bad entry in this matnx is in the position (4, 4). This is because of the fact that the four lines chosen,contained three coplanar lines (lines B. D and E). This causes the values of the invariant to be indeterminate (that is (0, 0, O)), and shows that such instances must be detected and avoided. Once again, the four-line invariant is shown to be a useful discriminator between sets of four lines. ACKNOWLEDGMENT I am indebted to J. Mundy for introducing me to the subject of projective invariants, and for many enlightening conversations during the preparation of this correspondence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Robust Dense Matching Using Local and Global Geometric Constraints

A new robust dense matching algorithm is introduced in this paper: The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densib the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded...

متن کامل

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

Depth Recovery from Stereo Matching Using Coupled Random Fields. (Méthodes d'estimation de la profondeur par mise en correspondance stéréoscopique à l'aide de champs aléatoires couplés)

The depth of objects in 3-D scene can be recovered from a stereo image-pair by findingcorrespondences between the two views. This stereo matching task involves identifying thecorresponding points in the left and the right images, which are the projections of the samescene point. The difference between the locations of the two corresponding points is thedisparity, which is invers...

متن کامل

Local Feature Selection and Global Energy Optimization in Stereo

The human brain can fuse two slightly different views from left and right eyes and perceive depth. This process of stereopsis entails identifying matching locations in the two images and recovering the depth from their disparity. This can be done only approximately: ambiguity arising from such factors as noise, periodicity, and large regions of constant intensity makes it impossible to identify...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1994